Improving solution characteristics of particle swarm optimization through the use of digital pheromones, parallelization, and graphical processing units (GPUs)

نویسندگان

  • Vijay Kiran Kalivarapu
  • Adin Mann
  • James Oliver
  • Judy Vance
  • Julie Dickerson
چکیده

Optimization has its foundations dating back to the days of Newton, Lagrange, Cauchy, and Leibnitz when differential calculus methods were developed to minimize and maximize analytical functions. Substantial progress in optimization became more prominent in the mid to late twentieth century when digital computers showed promise in offloading analytical problem solving into numerical methods through computer code for faster evaluations of

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An approach to Improve Particle Swarm Optimization Algorithm Using CUDA

The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...

متن کامل

A Statistical Analysis of Particle Swarm Optimization With and Without Digital Pheromones

Particle Swarm Optimization (PSO) is a population based heuristic search method for finding global optimal values in multi-disciplinary design optimization problems. PSO is based on simple social behavior exhibited by birds and insects. Due to its simplicity in implementation, PSO has been increasingly gaining popularity in the optimization community. Previous work by the authors demonstrated s...

متن کامل

Improving Solution Characteristics of Particle Swarm Optimization using Digital Pheromones

In this paper, a new approach to Particle Swarm Optimization (PSO) using digital pheromones to coordinate swarms within an n-dimensional design space is presented. In a basic PSO, an initial randomly generated population swarm propagates towards the global optimum over a series of iterations. The direction of the swarm movement in the design space is based on an individual particle’s best posit...

متن کامل

Implementation of Digital Pheromones for Use in Particle Swarm Optimization

This paper presents a new approach to particle swarm optimization (PSO) using digital pheremones to coordinate the movements of the swarm within an n-dimensional design space. In traditional PSO, an initial randomly generated population swarm propagates towards the global optimum over a series of iterations. Each particle in the swarm explores the design space based on the information provided ...

متن کامل

Lévy-Flights for Particle Swarm Optimisation Algorithms on Graphical Processing Units

Particle Swarm Optimisation (PSO) is a powerful algorithm for space search problems such as parametric optimisation. Particles with Lévy-Flights have a long-tailed probability of outlier jumps in the problem space that provide a good compromise between local space exploration and local minima avoidance. Generating many particles and their trajectories with Lévy-random deviates is computationall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015